Math 274: Tropical Geometry Assignment IV

نویسنده

  • Maria Angelica Cueto
چکیده

Exercise 1. [Solution due to Alex Fink] Invoking our fan structure for T (M), we know that a general point x = (x1, . . . , xn) ∈ T (M) has the property that xi = a(min{j : i ∈ Fj}) for some reals a(1) > · · · > a(s), where ∅ = F0 ( · · · ( Fs = [n] is a flag of flats of M of some length. This point x lies in the relative interior of the cone corresponding to the flag {Fi}. In particular, the points x ∈ T (M) with exactly two distinct components arise from a flag of length s = 2, where F1 is a flat other than ∅ or [n]; and F1 is the set of indices i such that xi is the lesser of the two occurring values. This lets us recover all the nonempty flats of M from T (M) (which in particular is enough data to recover M). Now, we have that the bases B of M are exactly those subsets of [n] which can be obtained by choosing a maximal flag of flats

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tropical Hurwitz numbers

Hurwitz numbers count genus g, degree d covers of P1 with fixed branch locus. This equals the degree of a natural branch map defined on the Hurwitz space. In tropical geometry, algebraic curves are replaced by certain piece-wise linear objects called tropical curves. This paper develops a tropical counterpart of the branch map and shows that its degree recovers classical Hurwitz numbers. Furthe...

متن کامل

A Tropical Intersection Product in Matroidal Fans

We construct an intersection product on tropical cycles contained in the Bergman fan of a matroid. To do this we first establish a connection between the operations of deletion and restriction in matroid theory and tropical modifications as defined by Mikhalkin in [14]. This product generalises the product of Allermann and Rau [2], and Allermann [1] and also provides an alternative procedure fo...

متن کامل

Math 274 : Tropical Geometry , Homework 5

Proof. [Solution due to Claudiu Raicu] Consider two polynomials f, g ∈ C[X±] such that the spherical graphs they determine intersect transversely at the points where the vectors vi intersect the sphere. This implies that T (f) and T (g) intersect transversely ([1]) at each point and T (f)∩T (g) = Σ. Using the Transverse Intersection Lemma (lemma 3.2, corollary 3.3 of [1]) we get that Σ = T (f, ...

متن کامل

Convexity in Tree Spaces

We study the geometry of metrics and convexity structures on the space of phylogenetic trees, which is here realized as the tropical linear space of all ultrametrics. The CAT(0)-metric of Billera-Holmes-Vogtman arises from the theory of orthant spaces. While its geodesics can be computed by the Owen-Provan algorithm, geodesic triangles are complicated. We show that the dimension of such a trian...

متن کامل

On the L(2, 1)-labelling of block graphs

The distance-two labeling problem of graphs was proposed by Griggs and Roberts in 1988, and it is a variation of the frequency assignment problem introduced by Hale in 1980. An L(2, 1)-labeling of a graph G is an assignment of nonnegative integers to the vertices of G such that vertices at distance two receive different numbers and adjacent vertices receive different and nonconsecutive integers...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009